منابع مشابه
Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
In this paper we introduce a new lattice problem, the subspace avoiding problem (Sap). We describe a probabilistic single exponential time algorithm for Sap for arbitrary `p norms. We also describe polynomial time reductions for four classical problems from the geometry of numbers, the shortest vector problem (Svp), the closest vector problem (Cvp), the successive minima problem (Smp), and the ...
متن کاملComputing shortest lattice vectors on special hardware
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, algorithmic number theory, communication theory, and cryptography. In 1996, Ajtai published his breakthrough idea how to create lattice-based oneway functions based on the worst-case hardness of an approximate version of SVP. Worst-case hardness is one of the outstanding properties of all modern ...
متن کاملParallel Enumeration of Shortest Lattice Vectors
Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Furthermore, lattice reduction is used to attack well-known cryptosystems like RSA. One of the algorithms used in lattice reduction is the enumeration algorithm (ENUM), that provably finds a shortest vector of a lattice. We prese...
متن کاملSieving for Shortest Vectors in Ideal Lattices
Lattice based cryptography is gaining more and more importance in the cryptographic community. It is a common approach to use a special class of lattices, so-called ideal lattices, as the basis of lattice based crypto systems. This speeds up computations and saves storage space for cryptographic keys. The most important underlying hard problem is the shortest vector problem. So far there is no ...
متن کاملNote on Shortest and Nearest Lattice Vectors
K is a centrally symmetric convex body with nonempty interior and fK(·) is also called the distance function of K because fK(x) = min{ρ ∈ R≥0 : x ∈ ρK}. The Euclidean norm is denoted by fB(·), where B is the n-dimensional unit ball, and the associated inner product is denoted by 〈·, ·〉. Finally, we denote by C the cube with edge length 2 and center 0, and thus fC(·) denotes the maximum norm. As...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1993
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.18.3.516